Practically Stabilizing Virtual Synchrony
نویسندگان
چکیده
Virtual synchrony is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is a key criterion for the success of such implementations. This is because large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant. That is, when using redundancy in numbers to overcome non-optimal behavior of participants and to gain global robustness and high availability. Self-stabilizing systems can tolerate transient faults that drive the system to an arbitrary unpredicted configuration. Such systems automatically regain consistency from any such arbitrary configuration, and then produce the desired system behavior. Practically self-stabilizing systems ensure the desired system behavior for practically infinite number of successive steps e.g., 2 steps. We present the first practically self-stabilizing virtual synchrony algorithm. The algorithm is a combination of several new techniques that may be of independent interest. In particular, we present a new counter algorithm that establishes an efficient practically unbounded counter, that in turn can be directly used to implement a self-stabilizing Multiple-Writer Multiple-Reader (MWMR) register emulation. Other components include self-stabilizing group membership, self-stabilizing multicast, and self-stabilizing emulation of replicated state machine. As we base the replicated state machine implementation on virtual synchrony, rather than consensus, the system progresses in more extreme asynchronous executions with relation to consensus-based replicated state machine. Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel. Email {dolev, liba}@cs.bgu.ac.il Partially supported by Rita Altura Trust Chair in Computer Sciences, Lynne and William Frankel Center for Computer Sciences and Israel Science Foundation (grant number 428/11). Department of Computer Science, University of Cyprus, Nicosia, Cyprus. Email {chryssis, imarco01}@cs.ucy.ac.cy Department of Engineering and Computer Science, Chalmers University of Technology, Gothenburg, SE-412 96, Sweden, [email protected].
منابع مشابه
Self-stabilizing Virtual Synchrony
Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the success of such implementations since large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant...
متن کاملWhen Consensus Meets Self-stabilization
This paper presents a self-stabilizing failure detector, asynchronous consensus and replicated state-machine algorithm suite, the components of which can be started in an arbitrary state and converge to act as a virtual state-machine. Self-stabilizing algorithms can cope with transient faults. Transient faults can alter the system state to an arbitrary state and hence, cause a temporary violati...
متن کاملExtended Virtual Synchrony
We formulate a model of extended virtual synchrony that deenes a group communication transport service for multicast and broadcast communication in a distributed system. The model extends the virtual synchrony model of the Isis system to support continued operation in all components of a partitioned network. The signiicance of extended virtual synchrony is that, during network partitioning and ...
متن کاملStrong and Weak Virtual Synchrony in Horus
A formal de nition of strong virtual synchrony capturing the semantics of virtual syn chrony as implemented in Horus is presented This de nition has the nice property that every message is delivered within the view in which it was sent However it is shown that in order to implement strong virtual synchrony the application program has to block messages during view changes An alternative de nitio...
متن کاملMeasuring synchronization among speakers reading together
It has been demonstrated that speakers are readily able to synchronize with a cospeaker when reading a prepared text together. The means by which a high degree of synchronization is attained are still unknown. We here present a novel measure of synchrony which allows us to follow the time course of synchronization among two speakers, based on the parallel acoustic signals. The method uses tradi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1502.05183 شماره
صفحات -
تاریخ انتشار 2015